'Transitivity' of Consequence Relations
نویسنده
چکیده
A binary relation R on a set S is transitive iff for all a, b, c ∈ S, if aRb and bRc, then aRc. This almost never applies to the relations logicians tend to think of as consequence relations; where such relations are relations on a set at all, they are rarely transitive. Yet it is common to hear consequence relations described as ‘transitive’, and to see rules imposed to ensure ‘transitivity’ of these relations. This paper attempts to clarify the situation.
منابع مشابه
Consistency Properties for Preference Relations: T-additive and T-multiplicative transitivity
Consistency of preference relations is associated with the study of the transitivity property. In this paper, we analyze the properties to be verified by a function, T , in order to obtain the value of preference of the alternative xi over the alternative xk when we already have the values of the preference of xi over xj , and of xj over xk. As a consequence, we define T -additive transitivity ...
متن کاملNew Consistency Properties for Preference Relations
Consistency of preference relations is associated with the study of the transitivity property. This is clearly related to the scales used for associating preferences values to judgements, and the conditions used to represent transitivity. Both issues, the scale to use and the consistency property, have been studied in the multiplicative model as well as in the fuzzy one. However, we make note t...
متن کاملComparing uncertainty data in epistemic and ontic sense used to decision making problem
In the paper aspect of comparability alternatives in decision making problem by imprecise or incomplete information isexamined. In particular, new definitions of transitivity based on the measure of the intensity preference between pairsof alternatives in epistemic and ontic case is presented and its application to solve decision making problem is proposed.
متن کاملOn Some New Forms of Cycle-Transitivity and Their Relation to Commutative Copulas
Recently, we introduced the framework of cycletransitivity as a general means of representing transitivity conditions on reciprocal relations. In this framework, for reciprocal relations, the concepts of T -transitivity and stochastic transitivity can be cast. The upper bound functions encountered in this framework for product-transitivity and dice-transitivity, conceptually related to the prob...
متن کاملQuasi-transitive and Suzumura consistent relations
We examine properties of binary relations that complement quasi-transitivity and Suzumura consistency in the sense that they, together with the original axiom(s), are equivalent to transitivity. In general, the conjunction of quasi-transitivity and Suzumura consistency is strictly weaker than transitivity but in the case of collective choice rules that satisfy further properties, the conjunctio...
متن کامل